Partitioned Binary Relations
نویسندگان
چکیده
We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented) Temperley-Lieb diagrams. We construct a one-parameter deformation of the category of partitioned binary relations and show that it gives rise to classical one-parameter deformations of partition, Brauer and Temperley-Lieb categories. Finally, we describe a factorization of partitioned binary relations into a product of certain idempotents and pairs of usual binary relations.
منابع مشابه
A Hybrid Reasoning Model for "Whole and Part" Cardinal Direction Relations
In our previous papers [Kor and Bennett, 2003; 2010], we have shown how the nine tiles in the projection-based model for cardinal directions can be partitioned into sets based on horizontal and vertical constraints (called Horizontal and Vertical Constraints Model). In order to come up with an expressive hybrid model for direction relations between two-dimensional singlepiece regions (without h...
متن کاملAn Expressive Hybrid Model for the Composition of Cardinal Directions
Abstract In our previous paper (Kor and Bennett, 2003), we have shown how the nine tiles in the projection-based model for cardinal directions can be partitioned into sets based on horizontal and vertical constraints (called Horizontal and Vertical Constraints Model). In order to come up with an expressive hybrid model for direction relations between two-dimensional single-piece regions (withou...
متن کاملOn-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms
We consider the problem of learning a certain type of lexical semantic knowledge that can be expressed as a binary relation between words, such as the so-called sub-categorization of verbs (a verb-noun relation) and the compound noun phrase relation (a noun-noun relation). Speci cally, we view this problem as an on-line learning problem in the sense of Littlestone's learning model [Lit88] in wh...
متن کاملA Hash Partition Strategy for Distributed Query Processing
This paper describes a hash partitioning strategy for distributed query processing in a multi-database environment in which relations are unfragmented and replicated. Methods and eecient algorithms are provided to determine the sets of relations that can be hash partitioned , the copies of the relations to be partitioned and the partition sites, how the relations are to be partitioned and where...
متن کاملOn Restructuring Nested Relations in Partitioned Normal Form
Relations in partitioned normal form are an important subclass of nested relations. This paper is concerned with the problem of restructuring relations in partitioned normal form to new and potentially very different schemes. The main problem with restructuring is to minimize the amount of information lost during the transformation. A new restructuring operator is defined which minimizes that l...
متن کامل